Domain-Heuristics for Arc-Consistency Algorithms
نویسنده
چکیده
Arc-consistency algorithms are widely used to prune the search-space of Constraint Satisfaction Problems (CSPs). They use support-checks (also known as consistency-checks) to find out about the properties of CSPs. They use arc-heuristics to select the next constraint and domain-heuristics to select the next values for their next support-check. We will investigate the effects of domain-heuristics by studying the average time-complexity of two arc-consistency algorithms which use different domain-heuristics. We will assume that there are only two variables. The first algorithm, called L, uses a lexicographical heuristic. The second algorithm, called D, uses a heuristic based on the notion of a double-support check. We will discuss the consequences of our simplification about the number of variables in the CSP and we will carry out a case-study for the case where the domain-sizes of the variables is two. We will present relatively simple formulae for the exact average time-complexity of both algorithms as well as simple bounds. As a and b become large L will require about 2a + 2b − 2 log(a) − 0.665492 checks on average, where a and b are the domain-sizes and log(·) is the base2 logarithm. D requires an average number of support-checks which is below 2 max(a, b) + 2 if a + b ≥ 14. Our results demonstrate that D is the superior algorithm. Finally, we will provide the result that on average D requires strictly fewer than two checks more than any other algorithm if a+ b ≥ 14.
منابع مشابه
Two New Lightweight Arc Consistency Algorithms
Coarse-grained arc consistency algorithms like AC-3, AC-3d, and AC-2001, are efficient when it comes to transforming a Constraint Satisfaction Problem (CSP) to its arc consistent equivalent. These algorithms repeatedly carry out revisions to remove unsupported values from the domains of the variables. The order of these revisions is determined by so-called revision ordering heuristics. In this ...
متن کاملA Theoretical Analysis of the Average-Time Complexity of Domain-Heuristics for Arc-Consistency Algorithms
متن کامل
AC-3d an Efficient Arc-Consistency Algorithm with a Low Space-Complexity
Arc-consistency algorithms prune the search-space of Constraint Satisfaction Problems (CSPs). They use support-checks to find out about the properties of CSPs. Their arc-heuristics select the constraint and their domain-heuristics select the values for the next support-check. We shall combine AC-3 and DEE and equip the resulting hybrid with a double-support domain-heuristic. The resulting hybri...
متن کاملOrdering Heuristics for Arc Consistency Algorithms
Arc consistency algorithms are used in solving constraint satisfaction problems and are important in constraint logic programming languages. Search order heuristics for arc consistency algorithms signiicantly enhance the ef-ciency of their implementation. In this paper we propose and evaluate several ordering heuristics. Care is taken with experimental design , involving random problems, and st...
متن کاملAbscon 2005
This paper describes the algorithms, heuristics and strategies used by the two solvers which have been elaborated from the Abscon platform and submitted to the first CSP solver competition. Both solvers maintain arc consistency during search, explore the search space using a conflict-directed variable ordering heuristic and integrate a restart strategy. At preprocessing, the first solver establ...
متن کامل